Equality Constraints in Multiple Correspondence Analysis.
نویسندگان
چکیده
The application of equality constraints on the categories of a variable is a simple but useful extension of multiple correspondence analysis. Equality can be used to incorporate prior knowledge about the relations between categories. Categories may belong to the same variable, to different variables, or both. The simplest form of equality specifies that all variables receive identical data transforms. This is useful, for example, if the same variable is measured on many points of time. This article outlines a procedure to deal with unequal category numbers and with subsets of variables. Though the technical results are not difficult to derive, they are not very well-known. Some applications illustrate the method.
منابع مشابه
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting
We introduce equality up-to constraints over nite trees and investigate their expressiveness. Equality up-to constraints subsume equality constraints, subtree constraints, and one-step rewriting constraints. We establish a close correspondence between equality up-to constraints over nite trees and context uniication. Context uniication subsumes string uniication and is subsumed by linear second...
متن کاملEntailment with Conditional Equality Constraints ( Extended
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints and for a nat...
متن کاملEntailment with Conditional Equality Constraints
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints. Additionally...
متن کاملThe Complexity of Entailment Problems over Conditional Equality Constraints ?
Equality constraints (a.k.a. unification constraints) have widespread use in static program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow more accurate analyses and more expressive type systems. In this paper, we present a complete complexity characterization of the various entailmen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Multivariate behavioral research
دوره 27 4 شماره
صفحات -
تاریخ انتشار 1992